Identities for circuit partition polynomials, with applications to the Tutte polynomial

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identities for circuit partition polynomials , with applications to the Tutte polynomial

The Martin polynomials, introduced by Martin in his 1977 thesis, encode information about the families of circuits in Eulerian graphs and digraphs. The circuit partition polynomials, J (G;x) and j ( G;x), are simple transformations of the Martin polynomials. We give new identities for these polynomials, analogous to Tutte’s identity for the chromatic polynomial. Following a useful expansion of ...

متن کامل

The Circuit Partition Polynomial with Applications and Relation to the Tutte and Interlace Polynomials

This paper examines several polynomials related to the field of graph theory including the circuit partition polynomial, Tutte polynomial, and the interlace polynomial. We begin by explaining terminology and concepts that will be needed to understand the major results of the paper. Next, we focus on the circuit partition polynomial and its equivalent, the Martin polynomial. We examine the resul...

متن کامل

Graph Polynomials and Their Applications I: The Tutte Polynomial

We begin our exploration of graph polynomials and their applications with the Tutte polynomial, a renown tool for analyzing properties of graphs and networks. This two-variable graph polynomial, due to W. T. Tutte [Tut47,Tut54, Tut67], has the important universal property that essentially any multiplicative graph invariant with a deletion/contraction reduction must be an evaluation of it. These...

متن کامل

The Tutte polynomial and related polynomials

The Tutte polynomial was defined originally for graphs and extends to more generally to matroids. The many natural combinatorial interpretations of its evaluations and coefficients for graphs then translate to not obviously related combinatorial quantities in other matroids. For example, the Tutte polynomial evaluated at (2, 0) gives the number of acyclic orientations of a graph. Zaslavsky prov...

متن کامل

Convolution-multiplication identities for Tutte polynomials of matroids

Abstract. We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic operations. Several identities, almost all already known in some form, are specialization of this identity. Combinatorial or probabilistic interpr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2004

ISSN: 0196-8858

DOI: 10.1016/s0196-8858(03)00079-4